Recursively enumerable set - PDFSEARCH.IO - Document Search Engine

Recursively enumerable set
Results: 50

#	Item
31	A Computational Prospect of Infinity: ω1 -Recursion Theory Noam Greenberg Add to Reading List Source URL: www.ims.nus.edu.sg Language: English - Date: 2010-01-12 23:03:20 Mathematical logic Recursively enumerable set Enumeration Logic Computability theory Theory of computation Mathematics
32	Noname manuscript No. (will be inserted by the editor) Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2009-10-12 04:55:55 Enumeration Constructible universe Logic Ordinal number Recursively enumerable set Mathematics Mathematical logic Enumerative combinatorics
33	DEFINABILITY VIA KALIMULLIN PAIRS IN THE STRUCTURE OF THE ENUMERATION DEGREES HRISTO A. GANCHEV† AND MARIYA I. SOSKOVA†‡ Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2013-01-04 08:54:41 Turing degree Recursively enumerable set Turing reduction Reduction Structure Order Computability theory Mathematics Enumeration
34	The Local Structure of the Enumeration Degrees Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2008-07-19 09:57:30 Enumerative combinatorics Mathematical logic Enumeration Recursively enumerable set Degree Turing degree Mathematics Computability theory Theory of computation
35	PROGRAMME Sunday, 19 July 2009 CiE 2009 Mathematical Theory and Add to Reading List Source URL: www.math.uni-heidelberg.de Language: English - Date: 2009-07-30 07:35:12 Computer science Mathematics Hypercomputation Mathematical logic Algorithm Computable number Recursively enumerable set Turing reduction Computability Theory of computation Computability theory Theoretical computer science
36	The Turing universe in the context of enumeration reducibility Mariya I. Soskova Sofia University and University of California, Berkeley A fundamental goal of computability theory is to understand the way that Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2013-11-11 20:32:42 Mathematics Turing degree Turing reduction Turing jump Enumeration Low Recursively enumerable set Arithmetical hierarchy Halting problem Computability theory Theoretical computer science Mathematical logic
37	Cupping Computably Enumerable Degrees in the Difference Hierarchy Add to Reading List Source URL: www.ims.nus.edu.sg Language: English - Date: 2010-01-12 23:03:20 Applied mathematics Turing degree Recursively enumerable set Computable function Creative and productive sets Function Mathematical logic Computability theory Theory of computation Mathematics
38	Outline Some properties of c.e. reals in the sw-degrees Add to Reading List Source URL: www.ims.nus.edu.sg Language: English - Date: 2010-01-12 23:03:20 Constructible universe Computability theory Reduction Recursively enumerable set
39	Weak Degrees of ω Π0 Add to Reading List Source URL: www.ims.nus.edu.sg Language: English - Date: 2010-01-12 23:03:20 Turing reduction Albert Muchnik Turing degree Decision problem SL Recursively enumerable set Reduction Theoretical computer science Computability theory Applied mathematics
40	CANTOR’S DIAGONAL ARGUMENT: PROOF AND PARADOX Cantor’s diagonal method is elegant, powerful, and simple. It has been the source of Add to Reading List Source URL: wiki.laptop.org Language: English - Date: 2011-07-28 22:14:56 Theoretical computer science Mathematical logic Computable function Halting problem Primitive recursive function Church–Turing thesis Function Recursively enumerable set Algorithm Mathematics Theory of computation Computability theory